翻訳と辞書 Words near each other ・ Mulu (company) ・ Mulu Airport ・ Multistriatin ・ MultiSwap ・ Multiswitch ・ Multisyllabic rhymes ・ Multisymplectic integrator ・ Multisync (software) ・ Multisync monitor ・ Multisynthetase complex auxiliary component p38 ・ Multisystem developmental disorder ・ Multisystem proteinopathy ・ Multisystemic therapy ・ MultiTail ・ Multitap ・ Multitape Turing machine ・ Multitaper ・ Multitarget stool DNA screening test ・ Multitasker ・ Multitasking (disambiguation) ・ Multiteam system ・ Multiteatro ・ Multitenancy ・ Multitheoretical psychotherapy ・ Multithreading ・ Multithreading (computer architecture) ・ MultiThématiques ・ Multitier architecture ・ Multiton pattern ・ Multitone Records Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Multitape Turing machine ： ウィキペディア英語版 Multitape Turing machine A Multi-tape Turing machine is like an ordinary Turing machine with several tapes. Each tape has its own head for reading and writing. Initially the input appears on tape 1, and the others start out blank. This model intuitively seems much more powerful than the single-tape model, but any multi-tape machine, no matter how many tapes, can be simulated by a single-tape machine using only quadratically more computation time. Thus, multi-tape machines cannot calculate any more functions than single-tape machines, and none of the robust complexity classes (such as polynomial time) are affected by a change between single-tape and multi-tape machines. == Formal definition == A k-tape Turing machine can be described as a 6-tuple $M=\backslash langle\; Q,\; \backslash Gamma,\; s,\; b,\; F,\; \backslash delta\; \backslash rangle$ where: *$Q$ is a finite set of states *$\backslash Gamma$ is a finite set of the tape alphabet *$s\; \backslash in\; Q$ is the initial state *$b\; \backslash in\; \backslash Gamma$ is the blank symbol *$F\; \backslash subseteq\; Q$ is the set of final or accepting states *$\backslash delta:\; Q\; \backslash times\; \backslash Gamma^k\; \backslash rightarrow\; Q\; \backslash times\; (\backslash Gamma\; \backslash times\; \backslash )^k$ is a partial function called the transition function, where k is the number of tapes, L is left shift, R is right shift and S is no shift. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Multitape Turing machine」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.